Double Simulated Annealing for Functional Mri Analysis
نویسنده
چکیده
This report proposes a double simulated annealing (DSA) for functional magnetic resonance image (fMRI) analysis. The first simulated annealing (SA) is used to disconnect the brain from the skull. The second SA is applied to locate the activation area of the fMRIs. The performance evaluation of this approach includes receiver-operating characteristic (ROC) analysis, similarity analysis, and comparisons with other analytical methods such as classical SA (CSA), a t-Test, cross-correlation (CCR), and a general linear model (GLM). Experimental results show that the proposed algorithm can get better solutions than other approaches.
منابع مشابه
SIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملMR Brain Image Segmentation based on Markov Random Field with the Application of ACO
Magnetic resonance (MR) medical image segmentation plays an increasingly important role in computer-aided detection and diagnosis (CAD) of abnormalities. MRI segmentation manually is time consuming and consumes valuable human resources. Hence a great deal of efforts has been made to automate this process. Markov Random Field (MRF) has been one of the most active research areas of MRI brain segm...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملStochastic Analysis and Applications CONVERGENCE RATE OF MCMC AND SIMULATED ANNEAL- ING WITH APPLICATION TO CLIENT-SERVER ASSIGNMENT PROBLEM
Simulated annealing (SA) algorithms can be modeled as time-inhomogeneous Markov chains. Much work on the convergence rate of simulated annealing algorithms has been well-studied. In this paper, we propose an adiabatic framework for studying simulated annealing algorithm behavior. Specifically, we focus on the problem of simulated annealing algorithms that start from an initial temperature T0 an...
متن کامل